Timeless Planning and the Component Placement Problem

Planning is traditionally associated with the search for sequences of actions spread over time. In this paper we present a component placement problem (CPP), which is concerned with sequences of actions spread in the space of wide-area networks. We argue that, despite the lack of a time component, the CPP is a planning problem. We discuss complexity of the CPP and similarities between the CPP and traditional AI planning.